Fast Algorithms for One-Dimensional Compaction with Jog Insertion
نویسندگان
چکیده
منابع مشابه
Compaction on the Torus
In this paper we introduce a general framework for compaction on a torus. This problem comes up whenever an array of identical cells has to be compacted. We instantiate our framework with several specific compaction algorithms: one-dimensional compaction without and with automatic jog insertion and two-dimensional com-
متن کاملA Faster One-Dimensional Topological Compaction Algorithm
We consider the problem of one-dimensional topological com-paction with jog insertions. Combining both geometric and graph the-oretic approaches we present a faster and simpler algorithm, improving over previous results. The compaction algorithm takes as input a sketch consisting of a set F of features and a set W of wires, and minimizes the horizontal width of the sketch while maintaining its ...
متن کاملEfficient Cellular Automata Algorithms for Planar Graph and VLSI Layout Homotopic Compaction
One-dimensional homotopic compaction is defined as; In a given routable layout, a layout of minimum width is reachable by operations that can move each module horizontally as a unit, also deform lines maintaining their connections and maintain their routability. This paper exploits the nature of parallelism of this problem and introduces an efficient cellular automata algorithm for homotopic co...
متن کاملCell Compaction with Jogs Insertion Based on 45°-shear Line
In this paper, we investigated a one-dimensional compactor based on a 45°-shear line technique with jogs insertion for a cell layout. The compactor can be connected off line from current commercial layout tools, such as Tanner Pro’s L-Edit, Cadence’s Virtuoso or Springsoft’s Laker, using the CIF format. A data structure of edge-linked adjacent matrix is constructed for easy implementation in ou...
متن کاملFast Algorithms for Static Compaction of Sequential Circuit Test Vectors
Two fast algorithms for static test sequence compaction are proposed for sequential circuits. The algorithms are based on the observation that test sequences traverse through a small set of states, and some states are frequently re-visited throughout the application of a test set. Subse-quences that start and end on the same states may be removed if necessary and suucient conditions are met for...
متن کامل